Internal DLA generated by cookie random walks on $\mathbb{Z}$
نویسندگان
چکیده
منابع مشابه
Gaussian Networks Generated by Random Walks
We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to perform community detection, exploration tasks and to study temporal networks. Moreover, they have been used also to generate scale-free networks. In this wor...
متن کاملBoundaries and random walks on finitely generated infinite groups
We prove that almost every path of a random walk on a finitely generated non-amenable group converges in the compactification of the group introduced by W.J. Floyd. In fact, we consider the more general setting of ergodic cocycles of some semigroup of 1-Lipschitz maps of a complete metric space with a boundary constructed following Gromov. We obtain in addition that when the Floyd boundary of a...
متن کاملThe Arcsine law as the limit of the internal DLA cluster generated by Sinai's walk
We identify the limit of the internal DLA cluster generated by Sinai’s walk as the law of a functional of a Brownian motion which turns out to be a new interpretation of the Arcsine law.
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملInternal DLA in Higher Dimensions
Let A(t) denote the cluster produced by internal diffusion limited aggregation (internal DLA) with t particles in dimension d ≥ 3. We show that A(t) is approximately spherical, up to an O( √ log t) error. In the process known as internal diffusion limited aggregation (internal DLA) one constructs for each integer time t ≥ 0 an occupied set A(t) ⊂ Zd as follows: begin with A(0) = ∅ and A(1) = {0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2011
ISSN: 1083-589X
DOI: 10.1214/ecp.v16-1646